Preemptive and Non-Preemptive Real-Time Uni-Processor Scheduling
ثبت نشده
چکیده
منابع مشابه
A Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملNon-preemptive real-time scheduling of dataflow systems
Real-time signal processing applications can be described naturally with dataflow graphs. The systems we consider have a mix of real-time and non-real-time processing, where independent dataflow graphs represent tasks and individual dataflow actors are subtasks. Rate-monotonic scheduling is optimal for fixed-priority, preemptive scheduling of periodic tasks. Priority inheritance protocols exten...
متن کاملPreemptive Task Scheduling for Distributed Systems
Task scheduling in a preemptive runtime environment has potential advantages over the non-preemptive case such as better processor utilization and more flexibility when scheduling tasks. Furthermore, preemptive approaches may need less runtime support (e.g. no task ordering required). In contrast to the non-preemptive case, preemptive task scheduling in a distributed system has not received muc...
متن کاملReal-Time Scheduling of Parallel Tasks under a General DAG Model
Due to their potential to deliver increased performance over single-core processors, multi-core processors have become mainstream in processor design. Computation-intensive real-time systems must exploit intra-task parallelism to take full advantage of multi-core processing. However, existing results in real-time scheduling of parallel tasks focus on restrictive task models such as the synchron...
متن کاملA Few Results on Non-Preemptive Real Time Scheduling
In this paper, we investigate the non-preemptive scheduling problem as it arises in single processor systems. We focus on non-idling scheduling, the idling scheduling is briefly introduced in the lasts section. We extend some previously published results concerning preemptive and non-preemptive scheduling over a single processor. The main issue that we study in this article is the applicability...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996